group magicness of certain planar graphs

نویسندگان

mohammad javad nikmehr

samaneh bahramian

چکیده

let $a$ be a non-trivial abelian group and $a^{*}=asetminus {0}$. a graph $g$ is said to be $a$-magic graph if there exists a labeling$l:e(g)rightarrow a^{*}$ such that the induced vertex labeling$l^{+}:v(g)rightarrow a$, define by $$l^+(v)=sum_{uvin e(g)} l(uv)$$ is a constant map.the set of all constant integerssuch that $sum_{uin n(v)} l(uv)=c$, for each $vin n(v)$,where $n(v)$ denotes the set of adjacent vertices to vertex $v$ in $g$,is called the index set of $g$ and denoted by ${rm in}_{a}(g).$ in thispaper we determine the index set of certain planar graphsfor $mathbb{z}_{h}$, where $hin mathbb{n}$, such as wheels and fans.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group magicness of complete n-partite graphs

Let A be a non-trivial Abelian group. We call a graph G = (V, E) A-magic if there exists a labeling f : E → A∗ such that the induced vertex set labeling f : V → A, defined by f(v) = ∑ uv∈E f(uv) is a constant map. In this paper, we show that Kk1,k2,...,kn (ki ≥ 2) is A-magic, for all A where |A| ≥ 3.

متن کامل

Group connectivity of certain graphs

Let G be an undirected graph, A be an (additive) Abelian group and A∗ = A − {0}. A graph G is A-connected if G has an orientation such that for every function b : V (G) 7→ A satisfying ∑ v∈V (G) b(v) = 0, there is a function f : E(G) 7→ A∗ such that at each vertex v ∈ V (G), the net flow out of v equals b(v). We investigate the group connectivity number Λg(G) = min{n : G is A-connected for ever...

متن کامل

On certain Hamiltonian cycles in planar graphs

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that must be present in a 5-connected graph that is embedded into the plane or into the projective plane ...

متن کامل

On Certain Integral Schreier Graphs of the Symmetric Group

We compute the spectrum of the Schreier graph of the symmetric group Sn corresponding to the Young subgroup S2 × Sn−2 and the generating set consisting of initial reversals. In particular, we show that this spectrum is integral and for n ≥ 8 consists precisely of the integers {0, 1, . . . , n}. This implies that these graphs form a family of expanders (with unbounded degree).

متن کامل

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

Group edge choosability of planar graphs without adjacent short cycles

In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group (∆(G) + 1)-edgechoosable while some planar graphs with large girth and maximum degree is group ∆(G)-edge-choosable.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
transactions on combinatorics

ناشر: university of isfahan

ISSN 2251-8657

دوره 3

شماره 2 2014

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023